Two-stage Fast Matching Pursuit Algorithm for Multi-target Localization

نویسندگان

چکیده

For large-scale high-dimensional positioning scenes, the massive number of grid points brings challenges to multi-target algorithms based on compressed sensing. To cope with challenges, a fast localization method direction arrival is proposed. A sensing model constructed for DOA sequence measured by nodes. Then, two-stage matching pursuit algorithm presented sparse reconstruction, which consists preliminary estimation and supports rectification. process similar orthogonal adopted get estimate result, but no nonlinear operations employed complexity reduction. Then another iterative carried out rectify chosen in result sequentially. Simulation results verify effectiveness accuracy proposed localization.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast orthogonal matching pursuit algorithm

The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy...

متن کامل

EFBLA: A Two-Phase Matching Algorithm for Fast Motion Estimation

Introduction: The most popular algorithm for the VLSI implementation of motion estimation is the block-based full-search algorithm [1–3]. However, the full-search algorithm notoriously needs high computation load and large memory size. The high computational cost has become a major problem in the implementation of motion estimation. Many papers have proposed different ways to reduce the computa...

متن کامل

Two-stage multi-target joint learning for monaural speech separation

Recently, supervised speech separation has been extensively studied and shown considerable promise. Due to the temporal continuity of speech, speech auditory features and separation targets present prominent spectro-temporal structures and strong correlations over the time-frequency (T-F) domain, which can be exploited for speech separation. However, many supervised speech separation methods in...

متن کامل

Fast Least Square Matching

Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...

متن کامل

A remark about orthogonal matching pursuit algorithm

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3290031